On the Fréchet distance of a set of curves
نویسندگان
چکیده
e # where fo#]m range over continuous and increasing functions with foEqpDHrIs"t#!foE]u4HrIs"87q#nmnEgp HvIw" and mnE]u4HrIw$A7 . The functions fo#]m are also called parametrization functions. For polygonal curves x and y , consisting of z and { edges, Alt and Godau [2] developed an algorithm which computes their Fréchet distance in time |XEBz {>}~D5EBz { H]H . We will review this algorithm in Section 3. Another possibility of measuring the resemblance of two curves is the via the so-called Hausdorff distance 2 between the set of points which make up the two curves. For two bounded sets #j1 0)n ,
منابع مشابه
A Middle Curve Based on Discrete Fréchet Distance
Given a set of polygonal curves we seek to find a “middle curve” that represents the set of curves. We ask that the middle curve consists of points of the input curves and that it minimizes the discrete Fréchet distance to the input curves. We develop algorithms for three different variants of this problem.
متن کاملLocally Correct Fréchet Matchings
The Fréchet distance is a metric to compare two curves, which is based on monotonous matchings between these curves. We call a matching that results in the Fréchet distance a Fréchet matching. There are often many different Fréchet matchings and not all of these capture the similarity between the curves well. We propose to restrict the set of Fréchet matchings to “natural” matchings and to this...
متن کاملHomotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
The Fréchet distance between two curves in the plane is the minimum length of a leash that allows a dog and its owner to walk along their respective curves, from one end to the other, without backtracking. We propose a natural extension of Fréchet distance to more general metric spaces, which requires the leash itself to move continuously over time. For example, for curves in the punctured plan...
متن کاملGo with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves
We introduce a new distance measure for directed curves in R, called the direction-based Fréchet distance. Like the standard Fréchet distance, this measure optimizes over all parameterizations for a pair of curves. Unlike the Fréchet distance, it is based on differences between the directions of movement along the curves, rather than on positional differences. Hence, the direction-based Fréchet...
متن کاملApplied Similarity Problems Using Frechet Distance
The Fréchet distance is a well-known metric to measure similarity of polygonal curves. In the first part of this thesis, we introduce a new metric called Fréchet distance with speed limits and provide efficient algorithms for computing it. The classical Fréchet distance between two curves corresponds to the maximum distance between two point objects that traverse the curves with arbitrary non-n...
متن کامل